Sufficient conditions for n-matchable graphs
نویسندگان
چکیده
Let n be a non-negative integer. A graph G is said to be n-matchable if the subgraph G − S has a perfect matching for any subset S of V (G) with |S| = n. In this paper, we obtain sufficient conditions for different classes of graphs to be n-matchable. Since 2k-matchable graphs must be k-extendable, we have generalized the results about k-extendable graphs. All results in this paper are sharp.
منابع مشابه
On matchability of graphs
A graph is h-matchable if G-X has a perfect matching for every subset X ~ V(G) with IXI = h, and it is h-extendable if every matching of h edges can be extended to a perfect matching. It is proved that a graph G with even order is 2h-matchable if and only if (1) G is h-extendable; and (2) for any edge set D such that, for each e = xy E D, x,y E V(G) and e ~ E( G), G U D is h-extendable. Also ni...
متن کاملOn the edge-connectivity of C_4-free graphs
Let $G$ be a connected graph of order $n$ and minimum degree $delta(G)$.The edge-connectivity $lambda(G)$ of $G$ is the minimum numberof edges whose removal renders $G$ disconnected. It is well-known that$lambda(G) leq delta(G)$,and if $lambda(G)=delta(G)$, then$G$ is said to be maximally edge-connected. A classical resultby Chartrand gives the sufficient condition $delta(G) geq frac{n-1}{2}$fo...
متن کاملFinding all maximally-matchable edges in a bipartite graph
We consider the problem of finding all maximally-matchable edges in a bipartite graph G = (V,E), i.e., all edges that are included in some maximum matching. We show that given any maximum matching in the graph, it is possible to perform this computation in linear time O(n + m) (where n = |V | and m = |E|). Hence, the time complexity of finding all maximally-matchable edges reduces to that of fi...
متن کاملSufficient conditions for maximally edge-connected and super-edge-connected
Let $G$ be a connected graph with minimum degree $delta$ and edge-connectivity $lambda$. A graph ismaximally edge-connected if $lambda=delta$, and it is super-edge-connected if every minimum edge-cut istrivial; that is, if every minimum edge-cut consists of edges incident with a vertex of minimum degree.In this paper, we show that a connected graph or a connected triangle-free graph is maximall...
متن کامل0n removable cycles in graphs and digraphs
In this paper we define the removable cycle that, if $Im$ is a class of graphs, $Gin Im$, the cycle $C$ in $G$ is called removable if $G-E(C)in Im$. The removable cycles in Eulerian graphs have been studied. We characterize Eulerian graphs which contain two edge-disjoint removable cycles, and the necessary and sufficient conditions for Eulerian graph to have removable cycles h...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 29 شماره
صفحات -
تاریخ انتشار 2004